منابع مشابه
Endogenizing Epistemic Actions
Through a series of examples, we illustrate some important drawbacks that the action logic framework suffers from in its ability to represent the dynamics of information updates. We argue that these problems stem from the fact that the action model, a central construct designed to encode agents’ uncertainty about actions, is itself effectively common knowledge amongst the agents. In response to...
متن کاملEpistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. due to secrecy and deceit, as well as nested knowledge. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the c...
متن کاملMathematical symbols as epistemic actions
Recent experimental evidence fromdevelopmental psychology and cognitive neuroscience indicates that humans are equippedwith unlearned elementarymathematical skills. However, formal mathematics has properties that cannot be reduced to these elementary cognitive capacities. The question then arises how human beings cognitively deal with more advanced mathematical ideas. This paper draws on the ex...
متن کاملLogics of Temporal-Epistemic Actions
We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known “action models” from Dynamic Epistemic Logic. Our “temporal action models” may be used to define a number of informational actions that can modify the “objective” temporal struc...
متن کاملReduction axioms for epistemic actions
Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. We propose new versions that extend the underlying static epistemic languages in such a way that completeness proofs for the full dynamic systems can be obtained by perspicuous reduction axioms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.251.31